Extreme Palindromes
نویسندگان
چکیده
A recursively palindromic (RP) word is one that is a palindrome and whose left half-word and right half-word are each RP. Thus ABACABA is, and MADAM is not, an RP word. We count RP words of given length over a finite alphabet and RP compositions of an integer. We use the same method to determine the parity of the Catalan numbers.
منابع مشابه
Looking for All Palindromes in a String
A palindrome is a string of the form αα', where α and α' are also strings and reverse to each other. The problem of the paper is defined as follows: given a string S of length n, find all palindromes occurring in the given string S. In the paper, we present an algorithm based on suffix trees to find palindromes. Our algorithm will find all maximum palindromes which are not contained in any othe...
متن کاملFinding Palindromes: Variants and Algorithms
The problem of finding palindromes in strings appears in many variants: find exact palindromes, ignore punctuation in palindromes, require space around palindromes, etc. This paper introduces several predicates that represent variants of the problem of finding palindromes in strings. It also introduces properties for palindrome predicates, and shows which predicates satisfy which properties. Th...
متن کاملProperties of palindromes in finite words
We present a method which displays all palindromes of a given length from De Bruijn words of a certain order, and also a recursive one which constructs all palindromes of length n + 1 from the set of palindromes of length n. We show that the palindrome complexity function, which counts the number of palindromes of each length contained in a given word, has a different shape compared with the us...
متن کاملWhy Chromosome Palindromes?
We look at sex-limited chromosome (Y or W) evolution with particular emphasis on the importance of palindromes. Y chromosome palindromes consist of inverted duplicates that allow for local recombination in an otherwise nonrecombining chromosome. Since palindromes enable intrachromosomal gene conversion that can help eliminate deleterious mutations, they are often highlighted as mechanisms to pr...
متن کاملDevelopment of a Webbased Application to Detect Palindromes in Dna Sequences
Detecting palindromes in DNA sequence is a central problem in computational biology. Identifying palindromes could help scientists advance the understanding of genomic instability. DNA sequences containing long adjacent inverted repeats (palindromes) are inherently unstable and are associated with many types of chromosomal rearrangements. In this paper, we present a simple web-base tool to assi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The American Mathematical Monthly
دوره 115 شماره
صفحات -
تاریخ انتشار 2008